A dual simplex-type algorithm for the smallest enclosing ball of balls
نویسندگان
چکیده
We define the notion of infimum a set points with respect to second order cone. This problem can be showed equivalent minimum ball containing balls and maximum intersecting problem, as well others. present dual algorithm which viewed an extension simplex method solve this problem.
منابع مشابه
On the Smallest Enclosing Balls
In the paper a theoretical analysis is given for the smallest ball that covers a finite number of points p1, p2, · · · , pN ∈ R . Several fundamental properties of the smallest enclosing ball are described and proved. Particularly, it is proved that the k-circumscribing enclosing ball with smallest k is the smallest enclosing ball, which dramatically reduces a possible large number of computati...
متن کاملFitting the smallest enclosing Bregman balls
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learning, with the advent of one class classification. In this paper, we study the problem from a general standpoint, and suppose that the distortion is a Bregman divergence, without restriction. Applications of this formula...
متن کاملFitting the Smallest Enclosing Bregman Ball
Finding a point which minimizes the maximal distortion with respect to a dataset is an important estimation problem that has recently received growing attentions in machine learning, with the advent of one class classification. We propose two theoretically founded generalizations to arbitrary Bregman divergences, of a recent popular smallest enclosing ball approximation algorithm for Euclidean ...
متن کاملFast and Robust Smallest Enclosing Balls
I describe a C++ program for computing the smallest enclosing ball of a point set in d-dimensional space, using floating-point arithmetic only. The program is very fast for d ≤ 20, robust and simple (about 300 lines of code, excluding prototype definitions). Its new features are a pivoting approach resembling the simplex method for linear programming, and a robust update scheme for intermediate...
متن کاملSmallest Enclosing Disks (balls and Ellipsoids)
A simple randomized algorithm is developed which computes the smallest enclosing disk of a nite set of points in the plane in expected linear time. The algorithm is based on Seidel's recent Linear Programming algorithm, and it can be generalized to computing smallest enclosing balls or ellipsoids of point sets in higher dimensions in a straightforward way. Experimental results of an implementat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2021
ISSN: ['0926-6003', '1573-2894']
DOI: https://doi.org/10.1007/s10589-021-00283-6